New Conjugacy Condition and Its Resulting Nonlinear Conjugate Gradient Methods
نویسنده
چکیده
Conjugate gradient methods are a class of important methods for unconstrained optimization, especially when the dimension is large. This paper proposes a new conjugacy condition, which considers an inexact line search scheme but reduces to the old one if the line search is exact. Based on the new conjugacy condition, two nonlinear conjugate gradient methods are constructed. Convergence analysis for the two methods is provided. Our numerical results show that one of the methods is very eecient for the given test problems.
منابع مشابه
Another nonlinear conjugate gradient algorithm for unconstrained optimization
A nonlinear conjugate gradient algorithm which is a modification of the Dai and Yuan [Y.H. Dai and Y, Yuan, A nonlinear conjugate gradient method with a strong global convergence property, SIAM J. Optim., 10 (1999), pp.177-182.] conjugate gradient algorithm satisfying a parametrized sufficient descent condition with a parameter k δ is proposed. The parameter k δ is computed by means of the conj...
متن کاملAn accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
In this paper we suggest a new conjugate gradient algorithm that for all both the descent and the conjugacy conditions are guaranteed. The search direction is selected as a linear combination of 0 k ≥ 1 k g + − and where , k s 1 1 ( ) k k g f x + + = ∇ , and the coefficients in this linear combination are selected in such a way that both the descent and the conjugacy condition are satisfied at ...
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملOpen Problems in Nonlinear Conjugate Gradient Algorithms for Unconstrained Optimization
The paper presents some open problems associated to the nonlinear conjugate gradient algorithms for unconstrained optimization. Mainly, these problems refer to the initial direction, the conjugacy condition, the step length computation, new formula for conjugate gradient parameter computation based on function’s values, the influence of accuracy of line search procedure, how we can take the pro...
متن کاملOn Convergence and Restart Conditions for a Nonlinear Conjugate Gradient Method
A global convergence theorem for unconstrained minimization algorithms with an eecient line search is derived. The theorem applies to a new version of the conjugate gradient method derived here in terms of minimizing the eeect of zigzagging. The global convergence condition makes much weaker demands on the line search than previous methods. Local Q-linear convergence in a neighborhood of a stro...
متن کامل